On the Expressiveness of Internal Mobility in Name-Passing Calculi

نویسنده

  • Michele Boreale
چکیده

We consider πI, a fragment of the π-calculus where only exchange of private names among processes is permitted (internal mobility). The calculus πI enjoys a simpler mathematical treatment, very close to that of CCS. In particular, πI avoids the concept of substitution. We provide an encoding from the asynchronous π-calculus to πI and then prove that two processes are barbed equivalent in π-calculus if and only if their translations in πI cannot be distinguished, under barbed bisimilarity, by any translated static context. The result shows that, in name-passing calculi, internal mobility is the essential ingredient as far as expressiveness is concerned.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

-calculus, internal mobility, and agent-passing calculi

The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconngurations of the process linkage) using communication of names. Previous research has shown that the-calculus has much greater expressiveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this gap...

متن کامل

-calculus, Internal Mobility, and Agent-passing Calculi -calculus, Internal Mobility, and Agent-passing Calculi

The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconngurations of the process linkage) using communication of names. Previous research has shown that the-calculus has much greater expres-siveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this ga...

متن کامل

On the Expressiveness of Polyadicity in Higher-Order Process Calculi (Extended Abstract)

In higher-order process calculi the values exchanged in communications may contain processes. We describe a study of the expressive power of strictly higher-order process calculi, i.e. calculi in which only process passing is allowed and no name-passing is present. In this setting, the polyadicity (i.e. the number of parameters) allowed in communications is shown to induce a hierarchy of calcul...

متن کامل

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-understood for first-order calculi but not in the higher-order setting: synchronous vs. asynchronous communication and polyadic vs. monadic communication. First, and similarly to the first-order setting, synchronous p...

متن کامل

Higher-Order Concurrency: Expressiveness and Decidability Results

ion is an expression of the form (x)Pit is a parameterized process. An abstraction has a functional type. Applying an abstraction (x)P of type T → ♦ (where ♦ is the type of all processes) to an argument W of type T yields the process P{W/x}. The argument W can itself be an abstraction; therefore the order of an abstraction, that is, the level of arrow nesting in its type, can be arbitrarily hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996